Evolution of ethnocentrism on undirected and directed Barabási-Albert networks
نویسندگان
چکیده
Using Monte Carlo simulations, we study the evolution of contigent cooperation and ethnocentrism in the one-move game. Interactions and reproduction among computational agents are simulated on undirected and directed BarabásiAlbert (BA) networks. We first replicate the Hammond-Axelrod model of ingroup favoritism on a square lattice and then generalize this model on undirected and directed BA networks for both asexual and sexual reproduction cases. Our simulations demonstrate that irrespective of the mode of reproduction, ethnocentric strategy becomes common even though cooperation is individually costly and mechanisms such as reciprocity or conformity are absent. Moreover, our results indicate that the spread of favoritism toward similar others highly depends on the network topology and the associated heterogeneity of the studied population.
منابع مشابه
1 6 M ay 2 00 9 Evolution of ethnocentrism on undirected and directed Barabási - Albert networks
Using Monte Carlo simulations, we study the evolution of contigent cooperation and ethnocentrism in the one-move game. Interactions and reproduction among computational agents are simulated on undirected and directed BarabásiAlbert (BA) networks. We first replicate the Hammond-Axelrod model of ingroup favoritism on a square lattice and then generalize this model on undirected and directed BA ne...
متن کامل2 4 M ay 2 00 5 Ising model simulation in directed lattices and networks
On directed lattices, with half as many neighbours as in the usual undirected lattices, the Ising model does not seem to show a spontaneous mag-netisation, at least for lower dimensions. Instead, the decay time for flipping of the magnetisation follows an Arrhenius law on the square and simple cubic lattice. On directed Barabási-Albert networks with two and seven neighbours selected by each add...
متن کاملHigher order clustering coefficients in Barabási-Albert networks
Higher order clustering coefficients C(x) are introduced for random networks. The coefficients express probabilities that the shortest distance between any two nearest neighbours of a certain vertex i equals x, when one neglects all paths crossing the node i. Using C(x) we found that in the Barabási-Albert (BA) model the average shortest path length in a node’s neighbourhood is smaller than the...
متن کاملDepartamento de Física, Universidade Federal do Piauí, 64049-550, Teresina
The zero-temperature Glauber dynamics is used to investigate the persistence probability P (t) in the Potts model with Q = 3, 4, 5, 7, 9, 12, 24, 64, 128, 256, 512, 1024, 4096, 16384,..., 230 states on directed and undirected Barabási-Albert networks and Erdös-Rényi random graphs. In this model it is found that P (t) decays exponentially to zero in short times for directed and undirected ErdösR...
متن کاملAnalysis of the enzyme network involved in cattle milk production using graph theory
Understanding cattle metabolism and its relationship with milk products is important in bovine breeding. A systemic view could lead to consequences that will result in a better understanding of existing concepts. Topological indices and quantitative characterizations mostly result from the application of graph theory on biological data. In the present work, the enzyme network involved in cattle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009